LARGEST j-SIMPLICES IN d-CUBES: SOME RELATIVES OF THE HADAMARD MAXIMUM DETERMINANT PROBLEM
نویسندگان
چکیده
This paper studies the computationally diicult problem of nding a largest j-dimensional simplex in a given d-dimensional cube. The case in which j = d is of special interest, for it is equivalent to the Hadamard maximum determinant problem; it has been solved for innnitely many values of d but not for d = 14. (The subcase in which j = d 3 (mod 4) subsumes the famous problem on the existence of Hadamard matrices.) The known results for the case j = d are here summarized and used, but the main focus is on xed small values of j. When j = 1, the problem is trivial, and when j = 2 or j = 3 it is here solved completely (i.e., for all d). Beyond that, the results are fragmentary but numerous, and they lead to several attractive conjectures. Some other problems involving simplices in cubes are mentioned, and the relationship of largest simplices to D-optimal weighing designs is discussed.
منابع مشابه
Euclidean simplices generating discrete reflection groups
Let P be a convex polytope in the spherical space S, in the Euclidean space E, or in the hyperbolic space H. Consider the group GP generated by reflections in the facets of P . We call GP a reflection group generated by P . The problem we consider in this paper is to list polytopes generating discrete reflection groups. The answer is known only for some combinatorial types of polytopes. Already...
متن کاملOn generalized Hermite-Hadamard inequality for generalized convex function
In this paper, a new inequality for generalized convex functions which is related to the left side of generalized Hermite-Hadamard type inequality is obtained. Some applications for some generalized special means are also given.
متن کاملFinding many D-optimal designs by randomised decomposition and switching
The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant H(n) of a square {+1,−1}-matrix of given order n. Such a matrix with maximum determinant is called a Doptimal design of order n. We consider some cases where n 6= 0 mod 4, so the Hadamard bound is not attainable, but bounds due to Barba or Ehlich and Wojtas may be attainable. If R is a matrix with maximal (or c...
متن کاملOn braxtopes, a class of generalized simplices
In a d-simplex every facet is a (d−1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this paper we study a new class, braxtopes, which arise as the faces of periodically-cyclic Gale polytopes. We give a geometric construction for these polytopes ...
متن کاملOn subdifferential in Hadamard spaces
In this paper, we deal with the subdierential concept onHadamard spaces. Flat Hadamard spaces are characterized, and nec-essary and sucient conditions are presented to prove that the subdif-ferential set in Hadamard spaces is nonempty. Proximal subdierentialin Hadamard spaces is addressed and some basic properties are high-lighted. Finally, a density theorem for subdierential set is established.
متن کامل